Memory Usage Inference for Object-Oriented Programs
نویسندگان
چکیده
We present a type-based approach to statically derive symbolic closed-form formulae that characterize the bounds of heap memory usages of programs written in object-oriented languages. Given a program with size and alias annotations, our inference system will compute the amount of memory required by the methods to execute successfully as well as the amount of memory released when methods return. The obtained analysis results are useful for networked devices with limited computational resources as well as embedded software.
منابع مشابه
Amortised resource analysis for object-oriented programs
As software systems rise in size and complexity, the need for verifying some of their properties increases. One important property to be verified is the resource usage, i.e. how many resources the program will need for its execution, where resources include execution time, memory, power, etc. Resource usage analysis is important in many areas, in particular embedded systems and cloud computing....
متن کاملLocality Reasoning of Multithreaded Programs through Type Inference
In multithreaded object-oriented programs, locality refers to the dynamic scoping relation among threads and objects in a potentially shared-memory context. This paper calls for type-theoretic investigations into two forms of locality – thread locality and aggregate locality – and proposes a unified type inference algorithm to reason about them over unannotated real-world Java programs.
متن کاملA Formal Soundness Proof of Region-Based Memory Management for Object-Oriented Paradigm
Region-based memory management has been proposed as a viable alternative to garbage collection for real-time applications and embedded software. In our previous work we have developed a region type inference algorithm that provides an automatic compile-time region-based memory management for object-oriented paradigm. In this work we present a formal soundness proof of the region type system tha...
متن کاملNUTS: a Distributed Object-oriented Platform with High Level Communication Functions
An extensible object-oriented platform NUTS for distributed computing is described which is based on an object-oriented programming environment NUT, is built on top of the Parallel Virtual Machine (PVM), and hides all low-level features of the latter. The language of NUTS is a concurrent object-oriented programming language with coarsegrained parallelism and distributed shared memory communicat...
متن کاملGoing Against the Flow for Typeless Programming
We present YinYang, a language that supports typeless programming where all object types are inferred with full support for data polymorphic mutable fields, subtyping, genericity, overriding, and local reasoning about semantic feedback like type errors. YinYang supports these features by forgoing traditional set-based types, instead tracking usage requirements in modular term assignment graphs ...
متن کامل